Adaptive Replication in Distributed Content Delivery Networks

We address the problem of content replication in large distributed content delivery networks, composed of a data center assisted by many small servers with limited capabilities and located at the edge of the network. The objective is to optimize the placement of contents on the servers to offload as much as possible the data center. We model the system constituted by the small servers as a loss network, each loss corresponding to a request to the data center. Based on large system / storage behavior, we obtain an asymptotic formula for the optimal replication of contents and propose adaptive schemes related to those encountered in cache networks but reacting here to loss events, and faster algorithms generating virtual events at higher rate while keeping the same target replication. We show through simulations that our adaptive schemes outperform significantly standard replication strategies both in terms of loss rates and adaptation speed.Comment: 10 pages, 5 figure

A high speed Tri-Vision system for automotive applications

Purpose: Cameras are excellent ways of non-invasively monitoring the interior and exterior of vehicles. In particular, high speed stereovision and multivision systems are important for transport applications such as driver eye tracking or collision avoidance. This paper addresses the synchronisation problem which arises when multivision camera systems are used to capture the high speed motion common in such applications. Methods: An experimental, high-speed tri-vision camera system intended for real-time driver eye-blink and saccade measurement was designed, developed, implemented and tested using prototype, ultra-high dynamic range, automotive-grade image sensors specifically developed by E2V (formerly Atmel) Grenoble SA as part of the European FP6 project – sensation (advanced sensor development for attention stress, vigilance and sleep/wakefulness monitoring). Results : The developed system can sustain frame rates of 59.8 Hz at the full stereovision resolution of 1280 × 480 but this can reach 750 Hz when a 10 k pixel Region of Interest (ROI) is used, with a maximum global shutter speed of 1/48000 s and a shutter efficiency of 99.7%. The data can be reliably transmitted uncompressed over standard copper Camera-Link® cables over 5 metres. The synchronisation error between the left and right stereo images is less than 100 ps and this has been verified both electrically and optically. Synchronisation is automatically established at boot-up and maintained during resolution changes. A third camera in the set can be configured independently. The dynamic range of the 10bit sensors exceeds 123 dB with a spectral sensitivity extending well into the infra-red range. Conclusion: The system was subjected to a comprehensive testing protocol, which confirms that the salient requirements for the driver monitoring application are adequately met and in some respects, exceeded. The synchronisation technique presented may also benefit several other automotive stereovision applications including near and far-field obstacle detection and collision avoidance, road condition monitoring and others.Partially funded by the EU FP6 through the IST-507231 SENSATION project.peer-reviewe

Tracking costs of virulence in natural populations of the wheat pathogen, Puccinia striiformis f.sp.tritici

<p>Abstract</p> <p>Background</p> <p>Costs of adaptation play an important role in host-parasite coevolution. For parasites, evolving the ability to circumvent host resistance may trade off with subsequent growth or transmission. Such costs of virulence (<it>sensu </it>plant pathology) limit the spread of all-infectious genotypes and thus facilitate the maintenance of genetic polymorphism in both host and parasite. We investigated costs of three virulence factors in <it>Puccinia striiformis </it>f.sp.<it>tritici</it>, a fungal pathogen of wheat (<it>Triticum aestivum</it>).</p> <p>Results</p> <p>In pairwise competition experiments, we compared the fitness of near-isogenic genotypes that differed by a single virulence factor. Two virulence factors (<it>vir4</it>, <it>vir6</it>) imposed substantial fitness costs in the absence of the corresponding resistance genes. In contrast, the <it>vir9 </it>virulence factor conferred a strong competitive advantage to several isolates, and this for different host cultivars and growing seasons. In part, the experimentally derived fitness costs and benefits are consistent with frequency changes of these virulence factors in the French pathogen population.</p> <p>Conclusion</p> <p>Our results illustrate the variation in the evolutionary trajectories of virulence mutations and the potential role of compensatory mutations. Anticipation of such variable evolutionary outcomes represents a major challenge for plant breeding strategies. More generally, we believe that agro-patho-systems can provide valuable insight in (co)evolutionary processes in host-parasite systems.</p

Convergence of multivariate belief propagation, with applications to cuckoo hashing and load balancing.

International audienceThis paper is motivated by two applications, namely i) generalizations of cuckoo hashing, a computationally simple approach to assigning keys to objects, and ii) load balancing in content distribution networks, where one is interested in determining the impact of content replication on performance. These two problems admit a common abstraction: in both scenarios, performance is characterized by the maximum weight of a generalization of a matching in a bipartite graph, featuring node and edge capacities. Our main result is a law of large numbers characterizing the asymptotic maximum weight matching in the limit of large bipartite random graphs, when the graphs admit a local weak limit that is a tree. This result specializes to the two application scenarios, yielding new results in both contexts. In contrast with previous results, the key novelty is the ability to handle edge capacities with arbitrary integer values. An analysis of belief propagation algorithms (BP) with multivariate belief vectors underlies the proof. In particular, we show convergence of the corresponding BP by exploiting monotonicity of the belief vectors with respect to the so-called upshifted likelihood ratio stochastic order. This auxiliary result can be of independent interest, providing a new set of structural conditions which ensure convergence of BP

TurtleTablet : un jeu collaboratif et tangible sur tablette pour l'initiation à la programmation

National audienceLes jeux numériques sont souvent utilisés au collège pour initier les élèves aux bases de la programmation informatique. Par ailleurs, le travail en groupe tient une place très importante dans l’apprentissage des sciences et ces jeux sur ordinateur sont couramment effectués en groupe de deux élèves. Cependant, les interactions clavier-souris ou tactile, et la conception même de ces jeux freinent la collaboration. Le plus souvent, seul un élève est en-gagé dans l’activité à un moment donné. Pour favoriser une réelle pédagogie s’appuyant sur la collaboration, nous proposons TurtleTablet, un jeu sur tablette pour aider les élèves à comprendre comment se déroule l’exécution d’un algorithme. Les activités de ce jeu sont conçues pour un binôme d’élèves, de façon à ce que chacun ait un rôle actif. De plus, les élèves doivent manipuler des objets tangibles pour interagir avec la tablette. Ce mode d’interaction, déjà éprouvé sur tables interactives, est inédit sur tablette

Comprendre la logique de l’exécution d’un programme à l’aide d’interactions tangible

National audienceDepuis la réforme de 2016, la programmation informatique est désormais ensei-gnée dès le collègue. Les enseignants, qui ne sont pas encore formés dans cette matière, cherchent des outils pédagogiques susceptibles de les aider. C’est dans ce contexte que nous proposons le jeu éducatif TurtleTable qui présente deux ori-ginalités majeures. Tous d’abord, cette application n’est pas basée sur des activi-tés d’écriture de programme, comme la plupart des autres outils existants, mais sur l’exécution pas à pas d’un programme donné. Ces deux approches sont com-plémentaires et nécessaires à l’appréhension de la logique informatique dans sa globalité. Deuxièmement, TurtleTable se joue en manipulant des objets tangibles sur une table interactive. Les joueurs doivent déplacer ces objets sur une grille, en déroulant les instructions du programme qui est affiché à l’écran. Le jeu indique les instructions effectuées correctement en temps réel, permettant ainsi aux appre-nants de bien comprendre le principe de l’exécution d’un programme

Bipartite graph structures for efficient balancing of heterogeneous loads

International audienceThis paper considers large scale distributed content service platforms, such as peer-to-peer video-on-demand systems. Such systems feature two basic resources, namely storage and bandwidth. Their efficiency critically depends on two factors: (i) content replication within servers, and (ii) how incoming service requests are matched to servers holding requested content. To inform the corresponding design choices, we make the following contributions. We first show that, for underloaded systems, so-called proportional content placement with a simple greedy strategy for matching requests to servers ensures full system efficiency provided storage size grows logarithmically with the system size. However, for constant storage size, this strategy undergoes a phase transition with severe loss of efficiency as system load approaches criticality. To better understand the role of the matching strategy in this performance degradation, we characterize the asymptotic system efficiency under an optimal matching policy. Our analysis shows that -in contrast to greedy matching- optimal matching incurs an inefficiency that is exponentially small in the server storage size, even at critical system loads. It further allows a characterization of content replication policies that minimize the inefficiency. These optimal policies, which differ markedly from proportional placement, have a simple structure which makes them implementable in practice. On the methodological side, our analysis of matching performance uses the theory of local weak limits of random graphs, and highlights a novel characterization of matching numbers in bipartite graphs, which may both be of independent interest